Functional Broadcast Repair of Multiple Partial Failures in Wireless Distributed Storage Systems

We consider a distributed storage system with $n$ nodes, where user can recover the stored file from any notation="LaTeX">$k$ and study problem of repairing notation="LaTeX">$r$ partially failed nodes. broadcast repair , that is, notation="LaTeX">$d$ surviving nodes transmit broadcast messages on an error-free wireless channel to being repaired, which are then used, together data in local memories lost content. First, we derive trade-off between capacity repair bandwidth for partial multiple based cut-set bound information flow graphs. It is shown utilizing nature medium contents at reduces per node significantly. Then, list set invariant conditions sufficient functional code be feasible. further propose scheme satisfies high probability, its extension failures. The performance proposed meets all points curve admissible parameters when divisible by while employing linear subpacketization, important practical consideration design codes. Unlike random codes, conventionally used has lower overhead, input-output cost, computational complexity during repair.